Quadratic optimization over a polyhedral cone
نویسندگان
چکیده
منابع مشابه
A Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملA Smoothing Method for Sparse Optimization over Polyhedral Sets
In this paper, we investigate a class of heuristics schemes to solve the NP-hard problem of minimizing `0-norm over a polyhedral set. A wellknown approximation is to consider the convex problem of minimizing `1-norm. We are interested in nding improved results in cases where the problem in `1-norm does not provide an optimal solution to the `0-norm problem. We consider a relaxation technique us...
متن کاملPolyhedral Deformations of Cone Manifolds A Aalam
Two single parameter families of polyhedra P (ψ) are constructed in three dimensional spaces of constant curvature C(ψ). Identification of the faces of the polyhedra via isometries results in cone manifolds M(ψ) which are topologically S × S, S or singular S . The singular set of M(ψ) can have self intersections for some values of ψ and can also be the Whitehead link or form other configuration...
متن کاملSecond Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems
A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...
متن کاملA Potential Reduction Algorithm for Generalized Linear Complementarity Problem over a Polyhedral Cone
2000 Mathematics Subject Classification: 65H10, 90C33, 90C30.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2015
ISSN: 1547-5816
DOI: 10.3934/jimo.2016.12.269